An Ontology Design Pattern for Chess Games

نویسندگان

  • Adila Krisnadhi
  • Víctor Rodríguez-Doncel
  • Pascal Hitzler
  • Michelle Cheatham
  • Nazifa Karima
  • Reihaneh Amini
  • Ashley Coleman
چکیده

We present an ontology pattern describing records of chess games. Besides being an interesting modeling problem by itself, the fact that chess is one of the most popular game in the world with hundreds of millions of active players, including several millions online players led to a huge amount of chess game data available from various online chess databases. Furthermore, these data are becoming available as linked data with links to prominent datasets, such as DBPedia or GeoNames. However, there is still a lack of a well-designed schema that can ease linked data publishing of chess games. Our pattern is hoped to fill that gap.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pattern-Based Linked Data Publication: The Linked Chess Dataset Case

This paper discusses the relationship between ontology design patterns (ODPs), data models and linked data, proposing a method that simplifies the task of publishing linked data while adhering to good modeling practices that reuse well-studied ODPs. The method consists of providing the pattern along with a simplified view of it, the conversion queries to transform one into the other and the con...

متن کامل

Pattern-Based Ontology Design and Instantiation with Reasonable Ontology Templates

Reasonable Ontology Templates, OTTRs for short, are OWL ontology macros capable of representing ontology design patterns (ODPs) and closely integrating their use into ontology engineering. An OTTR is itself an OWL ontology or RDF graph, annotated with a special purpose OWL vocabulary. This allows OTTRs to be edited, debugged, published, identified, instantiated, combined, used as queries and bu...

متن کامل

Using Pattern Recognition and Selective Deepening to Solve Tsume Shogi

In chess brute-force search methods have been very successful. However, games like shogi have a game tree complexity that is much higher than chess. Therefore, it is unclear if the methods used for making strong chess programs will also be successful for other games. In our research we will attempt to use a more cognitively based method, pattern recognition, to build a strong shogi playing prog...

متن کامل

Search , Recognition , and Visualization in Chess : Rebuttal to Gobet ’ s Critique of Chabris & Hearst ( 2003 )

In an article published in Cognitive Science, Chabris and Hearst (2003; hereafter C&H) used computer analysis of errors in grandmaster games to measure the effects of additional thinking time and the ability to see the board on decision quality in expert-level chess. By comparing games played by the same players at rapid (R) and slower “classical” (C) time limits, we concluded that additional t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015